ML frame synchronization for turbo and LDPC codes

نویسندگان

  • Henk Wymeersch
  • Marc Moeneclaey
چکیده

This contribution introduces a novel maximumlikelihood (ML) frame synchronization technique for coded systems that exploits the code properties by accepting soft information from the MAP decoder. Simulation results are presented for turbo and LDPC codes, and are compared to performance results of a frame synchronizer that does not use the code properties. We show that code-aided frame synchronization is required for turbo codes and LDPC codes, in order to avoid either very long pilot sequences or a considerable overall BER degradation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Annex a Glossary

From: TM Synchronization and Channel Coding is used to protect the transfer frames against telemetry channel noise‐induced errors. Reference [3] describes the CCSDS Recommended Standard for TM Synchronization and Channel Coding, including specification of a convolutional code, a Reed‐ Solomon block‐oriented code, a concatenated coding system consisting of a convolutional inner code and a Reed‐S...

متن کامل

Design & Implementation of Concatenated Turbo/ldpc Codes for Deep Space Communications

Requirement for efficient decoding techniques for Turbo & LDPC codes are in demand, many applications incorporates either LDPC or Turbo codes nowadays, due to their excellent performance which practically approaches Shannon’s limit. Although the theoretical performance of both codes is impressive, their practical implementation leads to problems like numerical inaccuracy, limited memory resourc...

متن کامل

Code-aided ML joint delay estimation and frame synchronization

We present a novel maximum-likelihood (ML) algorithm for joint delay estimation and frame synchronization. The algorithm operates on coded signals, and exploits the code properties by accepting soft information from the MAP decoder. Issues of convergence are addressed and we show how computational complexity may be reduced without any performance degradation. Simulation results are presented fo...

متن کامل

On Turbo-Schedules for LDPC Decoding

The convergence rate of LDPC decoding is comparatively slower than turbo code decoding: 25 LDPC iterations versus 8-10 iterations for turbo codes. Recently, Mansour proposed a ‘turbo-schedule’ to improve the convergence rate of LDPC decoders. In this letter, we first extend the turbo-scheduling principle to the check messages. Second, we show analytically that the convergence rate of both turbo...

متن کامل

Code-aided Phase and Timing Ambiguity Resolution for AWGN Channels

We present a novel maximum-likelihood (ML) joint frame synchronization and carrier phase ambiguity resolution algorithm for coded systems that exploits the code properties by accepting soft information from the MAP decoder. Simulation results are presented for turbo codes, and are compared to performance results of a conventional algorithm that does not use the code properties. We show that cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003